Theorem-Proving for Computers: Some Results on Resolution and Renaming
نویسندگان
چکیده
منابع مشابه
global results on some nonlinear partial differential equations for direct and inverse problems
در این رساله به بررسی رفتار جواب های رده ای از معادلات دیفرانسیل با مشتقات جزیی در دامنه های کراندار می پردازیم . این معادلات به فرم نیم-خطی و غیر خطی برای مسایل مستقیم و معکوس مورد مطالعه قرار می گیرند . به ویژه، تاثیر شرایط مختلف فیزیکی را در مساله، نظیر وجود موانع و منابع، پراکندگی و چسبندگی در معادلات موج و گرما بررسی می کنیم و به دنبال شرایطی می گردیم که متضمن وجود سراسری یا عدم وجود سراسر...
Some Results on Baer's Theorem
Baer has shown that, for a group G, finiteness of G=Zi(G) implies finiteness of ɣi+1(G). In this paper we will show that the converse is true provided that G=Zi(G) is finitely generated. In particular, when G is a finite nilpotent group we show that |G=Zi(G)| divides |ɣi+1(G)|d′ i(G), where d′i(G) =(d( G /Zi(G)))i.
متن کاملResolution Theorem Proving
Lifting is one of the most important general techniques for accelerating dii-cult computations. Lifting was used by Alan Robinson in the early 1960's to accelerate rst order inference Robinson, 1965]. A complete inference procedure had been done by Martin Davis and Hillary Putnam a few years prior to Robinson's work Davis and Putnam, 1960]. Unfortunately, it was a ground procedure and suuered f...
متن کاملNon-Resolution Theorem Proving
This talk reviews those efforts in automatic theorem proving, during the past few years, which have emphasized techniques other than resolution. These include: knowledge bases, natural deduction, reduction, (rewrite rules), typing, procedures, advice, controlled forward chaining, algebraic simplification, built-in associativity and commutativity, models, analogy, and man-machine systems. Exampl...
متن کاملSome Theorem Proving Aids
Theorem proving can be a very useful formal method. However it currently takes a lot of time and study to learn how to use a theorem prover, and proving even apparently simple theorems can be tedious. Theorem proving, and its beneets in software and hardware development , should be accepted more readily and widely if new users can do larger proofs of more complete models earlier in their traini...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 1966
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/8.4.341